Random walks and the additive coagulation equationRavi
نویسنده
چکیده
Numerical simulations of hierarchical gravitational clustering in an expanding universe show that, as time evolves, small clusters merge with each other to form larger clusters, whereas fragmentation of clusters is relatively uncommon. Stochastic models of the hierarchical clustering process can provide insight into, as well as useful approximations to, the evolution measured in these simulations. The Poisson random walk excursion model, the Poisson Galton{Watson branching process, and the monodisperse additive coagulation equation are three examples of such stochastic models. When initially identical particles cluster from an initially Poisson spatial distibution, all three approaches give essentially the same description of how clusters grow. This paper shows that clustering from an initially Poisson distribution in which the initial particles do not all have the same mass can be described by simple generalizations of the models above. Such an initial distribution is said to be Compound Poisson. Therefore, excursions of random walks associated with Compound Poisson distributions are studied here. In such an excursion set model, clusters grow in essentially the same way as they do in the polydisperse additive coagulation model. Thus, the inter{relations between excursion set, branching process and coagulation models of clustering, associated with the Poisson distribution, also apply to Compound Poisson distributions. This means that, within the context of these models, when the initial conditions are Compound Poisson, then merger and accretion rates, and the entire merger history tree, can all be written analytically, just as for clustering from Poisson initial conditions.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملModerate Deviations and Laws of the Iterated Logarithm for the Local times of Additive Lévy Processes and Additive Random Walks
We study the upper tail behaviors of the local times of the additive Lévy processes and additive random walks. The limit forms we establish are the moderate deviations and the laws of the iterated logarithm for the L2-norms of the local times and for the local times at a fixed site. Subject classifications: 60F10, 60F15, 60J55, 60G52
متن کاملOn the Law of the Iterated Logarithm for Local Times of Recurrent Random Walks
We consider the law of the iterated logarithm (LIL) for the local time of one-dimensional recurrent random walks. First we show that the constants in the LIL for the local time and for its supremum (with respect to the space variable) are equal under a very general condition given in Jain and Pruitt (1984). Second we evaluate the common value of the constants, as the random walk is in the domai...
متن کاملCollision bounds for the additive Pollard rho algorithm for solving discrete logarithms
We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group G. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the elliptic curve discrete logarithm problem. Our bounds differ from the birthday bound O. p jGj/ by a factor of p log jGj and are based on mixing time estimates f...
متن کاملApproximately generalized additive functions in several variables
The goal of this paper is to investigate the solutionand stability in random normed spaces, in non--Archimedean spacesand also in $p$--Banach spaces and finally the stability using thealternative fixed point of generalized additive functions inseveral variables.
متن کامل